A note on the truth-table for ``if $p$ then $q$''.
نویسندگان
چکیده
منابع مشابه
On the Evaluation of If p then q Conditionals
We propose that when evaluating conditionals, people construct an imaginary world that contains the antecedent, and then evaluate the plausibility of the consequent being true in the same world. Thus, when asked for an estimate of the probability of the conditional, people should produce the conditional probability of its consequent given its antecedent. We contrast this view with a view based ...
متن کاملOn Sets Bounded Truth-Table Reducible to P-selective Sets
We show that if every NP set is polynomial time bounded truth table reducible to some P selective set then NP is contained in DTIME n O p logn In the proof we implement a recursive procedure that reduces the number of nondeterministic steps of a given nondeter ministic computation
متن کاملA NOTE ON THE (p; q)-HERMITE POLYNOMIALS
In this paper, we introduce a new generalization of the Hermite polynomials via (p; q)-exponential generating function and investigate several properties and relations for mentioned polynomials including derivative property, explicit formula, recurrence relation, integral representation. We also de ne a (p; q)analogue of the Bernstein polynomials and acquire their some formulas. We then provide...
متن کاملA Compositional Semantics for 'If Then' Conditionals
This paper presents the first compositional semantics for if then conditionals. The semantics of each element are first examined separately. The meaning of if is modeled according to a possible worlds semantics. The particle then is analyzed as an anaphoric word that places its focused element inside the context settled by a previous element. Their meanings are subsequently combined in order to...
متن کاملIf P != NP Then Some Strongly Noninvertible Functions Are Invertible
Rabi, Rivest, and Sherman alter the standard notion of noninvertibility to a new notion they call strong noninvertibility, and show—via explicit cryptographic protocols for secret-key agreement ([RS93,RS97] attribute this to Rivest and Sherman) and digital signatures [RS93,RS97]—that strongly noninvertible functions would be very useful components in protocol design. Their definition of strong ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1977
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093888125